Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
101	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
102	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
103	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
104	Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UK Add to Reading List Source URL: ilyasergey.net Language: English - Date: 2016-08-16 07:30:03 Polygons Geometry Mathematics Polygon triangulation Simple polygon Visibility polygon Polygon Art gallery problem Triangulation Star-shaped polygon Rectilinear polygon Star polygon
105	Signal Processing–134 Contents lists available at ScienceDirect Signal Processing journal homepage: www.elsevier.com/locate/sigpro Add to Reading List Source URL: jmread.github.io Language: English - Date: 2016-05-18 09:25:59 Statistics Monte Carlo methods Computational statistics Estimation theory Robot control Control theory Kalman filter Particle filter Resampling Bootstrapping Filtering problem
106	arXiv:1511.07147v1 [cs.LG] 23 NovA PAC Approach to Application-Specific Algorithm Selection∗ Rishi Gupta Tim Roughgarden Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-11-23 20:51:24 Mathematics Computational complexity theory Applied mathematics NP-complete problems Combinatorial optimization Operations research Mathematical optimization Machine learning Algorithm Greedy algorithm Heuristic Knapsack problem
107	Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Mathematics Computational complexity theory Geometry Polygons NP-complete problems Euclidean plane geometry Art gallery problem Computational geometry Vertex APX
108	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition
109	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem

UPDATE